Minimization of energy functionals applied to some inverse problems
نویسنده
چکیده
We consider a general class of problems of minimization of convex integral functionals subject to linear constraints. Using Fenchel duality, we prove the equality of the values of the minimization problem and its associated dual problem. This equality is a variational criterion for the existence of solution to a large class of inverse problems entering the class of generalized Fredholm integral equations. In particular, our abstract results are applied to marginal problems for stochastic processes. Such problems naturally arise from the probabilistic approaches to quantum mechanics.
منابع مشابه
Equivalence of a Generalized Conditional Gradient Method and the Method of Surrogate Functionals
This article combines techniques from two fields of applied mathematics: optimization theory and inverse problems. We investigate the equivalence of the classical conditional gradient method and the surrogate method, which has been recently proposed for solving inverse problems. The method of surrogate functionals aims at the solution of non-quadratic minimization problems where the solution is...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملCritical Point Theory for Nonsmooth Energy Functionals and Applications
In this paper we prove an abstract result about the minimization of nonsmooth functionals. Then we obtain some existence results for Neumann problems with discontinuities.
متن کاملMinimization of Linear Functionals Defined on Solutions of Large-scale Discrete Ill-posed Problems
The minimization of linear functionals defined on the solutions of discrete ill-posed problems arises, e.g., in the computation of confidence intervals for these solutions. In 1990, Eldén proposed an algorithm for this minimization problem based on a parametric programming reformulation involving the solution of a sequence of trust-region problems, and using matrix factorizations. In this paper...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کامل